Concave modulars.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-concave Programming Quasi-concave Programming

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

CFD Study of Concave Turbine

Computational fluid dynamics (CFD) is a powerful numerical tool that is becoming widely used to simulate many processes in the industry. In this work study of the stirred tank with 7 types of concave blade with CFD was presented. In the modeling of the impeller rotation, sliding mesh (SM) technique was used and RNG-k-ε model was selected for turbulence. Power consumption in various speeds in th...

متن کامل

Concave Compositions

Concave compositions are compositions (i.e. ordered partitions) of a number in which the parts decrease up to the middle summand(s) and increase thereafter. Perhaps the most surprising result is for even length, concave compositions where the generating function turns out to be the quotient of two instances of the pentagonal number theorem with variations of sign. The false theta function disco...

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1953

ISSN: 0025-5645

DOI: 10.2969/jmsj/00510029